#include <iostream>
using namespace std;

const int kMaxN = 1010;
const int kMaxX = 1e4 + 10;
const int kMod = 998244353;

int t[kMaxN];
int f[kMaxX];

int QuickPow(int a, int b) {
  int ret = 1;

  for (; b; b >>= 1) {
    if (b & 1) {
      ret = (long long)ret * a % kMod;
    }
    a = (long long)a * a % kMod;
  }
  return ret;
}

void Add(int& a, int b, int c) {
  a = (a + (long long)b * c) % kMod;
}

int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  int n, x, invn;
  cin >> n >> x;
  for (int i = 0; i < n; i++) {
    cin >> t[i];
  }
  invn = QuickPow(n, kMod - 2);
  f[0] = 1;
  for (int i = 0; i < x; i++) {
    for (int j = 0; j < n; j++) {
      if (i + t[j] > x) {
        continue;
      }
      Add(f[i + t[j]], f[i], invn);
    }
  }

  int ans = 0;
  for (int i = 0; i < t[0] && i <= x; i++) {
    Add(ans, f[x - i], invn);
  }
  cout << ans << "\n";
  return 0;
}